package datastructure.book.tujiesuanfa.queueastack.more;

public class Solution {

    /**
     * 输入：heights = [14,2,27,-5,28,13,39], limit = 3
     * 输出：[27,27,28,28,39]
     * 解释：
     *   滑动窗口的位置                最大值
     * ---------------               -----
     * [14 2 27] -5 28 13 39          27
     * 14 [2 27 -5] 28 13 39          27
     * 14 2 [27 -5 28] 13 39          28
     * 14 2 27 [-5 28 13] 39          28
     * 14 2 27 -5 [28 13 39]          39
     * 1 <= limit <= heights.length
     * -10000 <= heights[i] <= 10000
     * 使用O(n)时间复杂度
     */
    public int[] maxAltitude(int[] heights, int limit) {
        return null;
    }
}
